Characterising Probabilistic Processes Logically - (Extended Abstract)

Characterising Probabilistic Processes Logically

In this paper we work on (bi)simulation semantics of processes that exhibit both nondeterministic and probabilistic behaviour. We propose a probabilistic extension of the modal mu-calculus and show how to derive characteristic formulae for various simulation-like preorders over finite-state processes without divergence. In addition, we show that even without the fixpoint operators this probabil...

Towards Characterising Data Exchange Solutions in Open and Closed Words (Extended Abstract)

A Fully Abstract Metric-Space Denotational Semantics for Reactive Probabilistic Processes

We consider the calculus of Communicating Sequential Processes (CSP) [8] extended with action-guarded probabilistic choice and provide it with an operational semantics in terms of a suitable extension of Larsen and Skou’s [14] reactive probabilistic transition systems. We show that a testing equivalence which identifies two processes if they pass all tests with the same probability is a congrue...

Modal Stochastic Games

This paper presents an abstraction-refinement framework for Segala’s probabilistic automata (PA), a slight variant of Markov decision processes. We use Condon and Ladner’s two-player probabilistic game automata extended with possible and required transitions — as in Larsen and Thomsen’s modal transition systems — as abstract models. The key idea is to refine player-one and player-two states sep...

Independence Relations in Probabilistic Logic (Extended Abstract)

In “standard” probability theory, one lists all events that are logically possible, and then places a normalized measure over them. This scheme is rather dry. It may happen that the list of possible events is encoded through logical sentences, and one must employ logical reasoning to determine which events are included in probabilistic assessments. It may also happen that probabilistic assessme...